A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing
نویسندگان
چکیده
منابع مشابه
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem
Full terms and conditions of use: http://pubsonline.informs.org/page/terms-and-conditions This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more information, contact [email protected]. The...
متن کاملA Branch-and-Cut-and-Price Algorithm for the Capacitated Location-Routing Problem
In this paper we present an exact algorithm for the Capacitated LocationRouting Problem (CLRP) based on column and cut generation. The CLRP is formulated as a set-partitioning problem which also inherits all of the known valid inequalities for the flow formulations of the CLRP. We introduce five new families of inequalities that are shown to dominate some of the cuts from the two-index formulat...
متن کاملA Branch-and-Cut Algorithm for the Multi-Product Multi-Vehicle Inventory- Routing Problem
The combined operation of distribution and inventory control achieved through a vendor-managed inventory strategy creates a synergetic interaction which benefits supplier and customers. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be taken simultaneously, which yields a difficult combinatorial optimization problem. While most IRP research deals with a single...
متن کاملA Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem
We study a variant of the capacitated vehicle routing problem where the cost over each arc is defined as the product of the arc length and the weight of the vehicle when it traverses that arc. We propose two new mixed integer linear programming formulations for the problem: an arc-load formulation and a set partitioning formulation based on q-routes with additional constraints. A family of cycl...
متن کاملA branch-price-and-cut algorithm for the mixed capacitated general routing problem with time windows
We introduce the Mixed Capacitated General Routing Problem with Time Windows (MCGRPTW). This problem is defined over a mixed graph, for which some nodes, arcs and edges have strictly positive demand and must be serviced through a fleet of homogeneous capacitated vehicles. The aim is to find a set of least-cost vehicle routes that satisfy this requirement, while respecting pre-specified time win...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2020
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2019.0961